Cooperative Equilibrium beyond Social Dilemmas: Pareto Solvable Games
نویسندگان
چکیده
A recently introduced concept of cooperative equilibrium [7], based on the assumption that players have a natural attitude to cooperation, has been proven a powerful tool in predicting human behaviour in social dilemmas. In this paper, we extend this idea to more general game models, termed Pareto solvable games, which in particular include the Nash Bargaining Problem and the Ultimatum Game. We show that games in this class possess a unique pure cooperative equilibrium. Furthermore, for the Ultimatum Game, this notion appears to be strongly correlated with a suitably defined variant of the Dictator Game. We support this observation with the results of a behavioural experiment conducted using Amazon Mechanical Turk, which demonstrates that our approach allows for making statistically precise predictions of average behaviour in such settings.
منابع مشابه
Linguistic Fuzzy-logic Social Game of Cooperation
I develop a new game-theoretic approach based, not on conventional Boolean two-valued logic, but instead on linguistic fuzzy logic which admits linguistic truth values. A linguistic fuzzy game is defined with linguistic fuzzy strategies, linguistic fuzzy preferences, and the rules of reasoning and inferences of the game operate according to linguistic fuzzy logic, not Boolean logic. This leads ...
متن کاملNon - cooperative games with chained confirmed proposals
We propose a bargaining process with alternating proposals as a way of solving non-cooperative games, giving rise to Pareto efficient agreements which will, in general, differ from the Nash equilibrium of the constituent games. JEL classification: C72; C73; C78.
متن کاملExtrapolation in Games of Coordination and Dominance Solvable Games
We study extrapolation between games in a laboratory experiment. Participants in our experiment first play either the dominance solvable guessing game or a Coordination version of the guessing game for five rounds. Afterwards they play a 3x3 normal form game for ten rounds with random matching which is either a game solvable through iterated elimination of dominated strategies (IEDS), a pure Co...
متن کاملReinforcement social learning of coordination in cooperative multiagent systems
Coordination in cooperative multiagent systems is an important problem and has received a lot of attention in multiagent learning literature. Most of previous works study the problem of how two (or more) players can coordinate on Pareto-optimal Nash equilibrium(s) through fixed and repeated interactions in the context of cooperative games. However, in practical complex environments, the interac...
متن کاملEfficient Learning Equilibrium
We introduce efficient learning equilibrium (ELE), a normative approach to learning in non-cooperative settings. In ELE, the learning algorithms themselves are required to be in equilibrium. In addition, the learning algorithms must arrive at a desired value after polynomial time, and a deviation from the prescribed ELE become irrational after polynomial time. We prove the existence of an ELE (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.07599 شماره
صفحات -
تاریخ انتشار 2015